منابع مشابه
Fast Skew Partition Recognition
Chvátal defined a skew partition of a graph G to be a partition of its vertex set into two non-empty parts A and B such that A induces a disconnected subgraph of G and B induces a disconnected subgraph of G. Skew partitions are important in the characterization of perfect graphs. De Figuereido et al. presented a polynomial time algorithm which given a graph either finds a skew partition or dete...
متن کاملThe satisfactory partition problem
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighbors in its part as in the other part. This problem was introduced by Gerber and Kobler [GK98, GK00] and further studied by other authors but its complexity remained open until now. We prove in this paper that Satisfac...
متن کاملThe Object Partition Problem
We provide a theoretical framework for the "object partition problem". We begin by considering this problem In a rather abstract context. Consider the semantic domain of physical objects, and the syntactic domain of picture graphs. The object partition problem can be viewed In terms of specifying syntactic operations that yield partitions of the picture graph, which when interpreted In the sema...
متن کاملHandling Data Skew in Multiprocessor Database Computers Using Partition Tuning
Shared nothing multiprocessor archit.ecture is known t.o be more scalable to support very large databases. Compared to other join strategies, a hash-ba9ed join algorithm is particularly efficient and easily parallelized for this computation model. However, this hardware structure is very sensitive to the data skew problem. Unless the parallel hash join algorithm includes some load balancing mec...
متن کاملOn the sign-imbalance of skew partition shapes
Let the sign of a skew standard Young tableau be the sign of the permutation you get by reading it row by row from left to right, like a book. We examine how the sign property is transferred by the skew Robinson-Schensted correspondence invented by Sagan and Stanley. The result is a remarkably simple generalization of the ordinary non-skew formula. The sum of the signs of all standard tableaux ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/j.dam.2004.01.001